Evolving New Lexical Association Measures Using Genetic Programming

نویسندگان

Jan Snajder

Bojana Dalbelo Basic

Sasa Petrovic

Ivan Sikiric

چکیده

Automatic extraction of collocations from large corpora has been the focus of many research efforts. Most approaches concentrate on improving and combining known lexical association measures. In this paper, we describe a genetic programming approach for evolving new association measures, which is not limited to any specific language, corpus, or type of collocation. Our preliminary experimental results show that the evolved measures outperform three known association measures.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Global Supply Chain Management under Carbon Emission Trading Program Using Mixed Integer Programming and Genetic Algorithm

In this paper, the transportation problem under the carbon emission trading program ismodelled by mathematical programming and genetic algorithm. Since green supply chain issuesbecome important and new legislations are taken into account, carbon emissions costs are included inthe total costs of the supply chain. The optimisation model has the ability to minimise the total costsand provides the ...

متن کامل

Modeling Ghotour-Chai River’s Rainfall-Runoff process by Genetic Programming

Considering the importance of water and computing the amount of rainfall runoff resulted from precipitation in recent decades, using appropriate methods for predicting the amount of runoff from rainfall date has been really essential. Rainfall-runoff models are used to estimate runoff generated from precipitation in the catchment area. Rainfall-runoff process is totally a non-linear phenomenon....

متن کامل

Profit maximization solid transportation problem under budget constraint using fuzzy measures

Fixed charge solid transportation problems are formulated as profit maximization problems under a budget constraint at each destination. Here item is purchased in different depots at different prices. Accordingly the item is transported to different destinations from different depots using different vehicles. Unitsare sold from different destinations to the customers at different selling prices...

متن کامل

Evolving genetic algorithm for Job Shop Scheduling problems

This paper addresses an attempt to evolve genetic algorithms by a particular genetic programming method to make it able to solve the classical Job Shop Scheduling problem (JSSP), which is a type of very well known hard combinatorial optimisation problems. The aim is to look for a better GA such that solves JSSP with preferable scores. This looking up procedure is done by evolving GA with GP. Fi...

متن کامل